Distance domination, guarding and covering of maximal outerplanar graphs
نویسندگان
چکیده
منابع مشابه
Distance domination, guarding and vertex cover for maximal outerplanar graph
This paper discusses a distance guarding concept on triangulation graphs, which can be associated with distance domination and distance vertex cover. We show how these subjects are interconnected and provide tight bounds for any n-vertex maximal outerplanar graph: the 2d-guarding number, g2d(n) = ⌊ n 5 ⌋; the 2d-distance domination number, γ2d(n) = ⌊ n 5 ⌋; and the 2d-distance vertex cover numb...
متن کاملMonitoring maximal outerplanar graphs
In this paper we define a new concept of monitoring the elements of triangulation graphs by faces. Furthermore, we analyze this, and other monitoring concepts (by vertices and by edges), from a combinatorial point of view, on maximal outerplanar graphs.
متن کاملAlgorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs
We show that there exist linear-time algorithms that compute the strong chromatic index of Halin graphs, of maximal outerplanar graphs and of distance-hereditary graphs.
متن کاملEdge covering pseudo-outerplanar graphs with forests
A graph is called pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, we prove that each pseudo-outerplanar graph admits edge decompositions into a linear forest and an outerplanar graph, or a star forest and an outerpla...
متن کاملOn dominating sets of maximal outerplanar graphs
A dominating set of a graph is a set S of vertices such that every vertex in the graph is either in S or is adjacent to a vertex in S. The domination number of a graph G, denoted γ (G), is theminimum cardinality of a dominating set ofG. We show that ifG is an n-vertexmaximal outerplanar graph, then γ (G) ≤ (n + t)/4, where t is the number of vertices of degree 2 in G. We show that this bound is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.08.040